Stability of Token Passing

نویسندگان

  • Leonidas Georgiadis
  • Wojciech Szpankowski
چکیده

Suucient stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance evaluation of token passing rings "it is convenient to derive stability conditions ... (without proof)". Our intention is to ll this gap, and provide a formal proof of the suucient and necessary stability condition for the token passing ring. In this paper we present the case when the arrival process to each queue is Poisson but service times and switchover times are generally distributed. We consider in depth gated`-limited (` 1) service discipline for each station. We also indicate that the basic steps of our technique can be used to study the stability of some other multiqueue systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability Criteria For Yet Another Multidimensional Distributed System

Wojciech Szpankowski* Department of Computer Science Purdue University W. Lafayette. IN 47907 U.S.A. We present sufficient and necessary conditions for stability of the time-limited token passing ring introduced recently by Lueng and Eisenberg. This was an open problem up to date. In general. establishing stability for multidimensional distributed systems is notoriously a difficult problem. We ...

متن کامل

Stability of token passing rings

A sufficient stability condition for the standard token passing ring has been "known" since the seminal paper by Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to the research community. In fact, Watson observed that in the performance evaluation of token passing rings, "it is convenient to derive stability conditions....

متن کامل

Stability of token passing rings

Wojciech SzpankowsklDepartment of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. The stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance eval...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A total ordering protocol using a dynamic token-passing scheme

Solutions to the total ordering problem can be used to maintain consistency in distributed system applications such as replicated databases. We propose a total ordering protocol based on a dynamic token-passing scheme which determines the next token holder dynamically, not in predetermined order. The proposed protocol provides fast stability time, uses a small buffer, and distributes evenly the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992